Exact and rapid linear clustering of networks with dynamic programming
نویسندگان
چکیده
We study the problem of clustering networks whose nodes have imputed or physical positions in a single dimension, such as prestige hierarchies similarity dimension hyperbolic embeddings. Existing algorithms, critical gap method and other greedy strategies, only offer approximate solutions. Here, we introduce dynamic programming approach that returns provably optimal solutions polynomial time -- O(n^2) steps for broad class objectives. demonstrate algorithm through applications to synthetic empirical networks, show it outperforms existing heuristics by significant margin, with similar execution time.
منابع مشابه
Exact clustering in linear time
The time complexity of data clustering has been viewed as fundamentally quadratic, slowing with the number of data items, as each item is compared for similarity to preceding items. Clustering of large data sets has been infeasible without resorting to probabilistic methods or to capping the number of clusters. Here we introduce MIMOSA, a novel class of algorithms which achieve linear-time comp...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولSolving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks
Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. In this paper, to solve this problem, we combine a discretization method and a neural network method. By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem. Then, we use...
متن کاملExact Subspace Clustering in Linear Time
Subspace clustering is an important unsupervised learning problem with wide applications in computer vision and data analysis. However, the state-of-the-art methods for this problem suffer from high time complexity—quadratic or cubic in n (the number of data instances). In this paper we exploit a data selection algorithm to speedup computation and the robust principal component analysis to stre...
متن کاملExact solutions to linear programming problems
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutions, taking advantage of the speed of floating-point calculations and attempting to minimize the operations performed in rational arithmetic. Extensive computational results are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of The Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2023
ISSN: ['1471-2946', '1364-5021']
DOI: https://doi.org/10.1098/rspa.2023.0159